منابع مشابه
The zig-zag product
The expander constructions based on algebraic methods can give expanders that are both explicit (i.e. we can quickly construct the graph, or even obtain neighborhood information without constructing the entire graph, and Ramanujan, meaning that the spectral gap is essentially as large as possible. It also follows from this spectral bound that the edge expansion of Ramanujan graphs is essentiall...
متن کاملZig-zag Path to Understanding
OUT understanding of the fundamental physical limits of information handling has developed along a very convoluted path. Most of the initially plausible physical conjectures have turned out to be wrong. A participant’s personal view of these events is not a disciplined contribution to the history of science. I do, however, last my own mistakes along with those of others.
متن کاملZig-zagging in a Triangulation
Let T = (V, F,E) be a 2-dimensional triangular tiling of R 2 in quad-edge representation [2], consisting of a set of vertices V , a set of faces F and a set of half-edges E. We say T is locally finite iff for any circle in R 2 it holds that the set consisting of all edges (vertices, faces) in T that intersect the circle (circumference or interior) is finite. Let e ∈ E be some half-edge of this ...
متن کاملZIG-ZAG PVD – A Nontraditional Approach
Communication has to be secure in order to be kept private. The latest developments in the field of digital communication have made secret communication possible. Image hiding is a method in which a secret image is hidden in a cover image thereby forming a hybrid or stego image. In this paper, data hiding is performed by taking difference value of three and two neighbouring pixels by adapting Z...
متن کاملZig-Zag Numberlink is NP-Complete
When can t terminal pairs in an m× n grid be connected by t vertex-disjoint paths that cover all vertices of the grid? We prove that this problem is NP-complete. Our hardness result can be compared to two previous NP-hardness proofs: Lynch’s 1975 proof without the “cover all vertices” constraint, and Kotsuma and Takenaga’s 2010 proof when the paths are restricted to have the fewest possible cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Technology Innovations in Statistics Education
سال: 2013
ISSN: 1933-4214
DOI: 10.5070/t573020093